Undoubtedly the holy Quran is a unique book in Arabic language, eloquently and rhetorically. Its words are a pure collection of Arabic literature. All poets, jurisprudents and philosophers believe it as a master art. It is a permanent treasure of Arabic and for it many sciences have been generated. It kept the Arabic language active and dynamic during ups and downs of the history. It also contains local Arabic accents which it shows the trustiness of its phonetic and structure.In this article is studied an explanation of grammatical meaning, understanding the differences between speech patterns, finding out grammatical meanings in speech patterns, and their differences in briefness, Redundancy, transparency and Ambiguity. If the Grammar gets excluded of its meaning it would make it dead and prosaic.It study Arabic Grammar based on the holy Quran. Thus we are going to study different grammatical patterns which it would lead to different meanings. We believe that although the statements and meanings used in Quran mention a grammatical pattern, it wouldn’t be so in Arabic poems and texts. In Quranit is not going to introduce grammatical patterns, it was the cause and source of establishment of the science of Grammar. So Quran is the base of Grammar. This article focuses on the books such as “Ma’ani alnahv” by Fazel Al-samaraee , “nahv alQuran” by Abd alsattar Javari and “Men vahy alQuran” by Ebrahim samaraee which are written for the Grammar of the Quran.

Hypergroups that have at least one identity element and where each element has at least one inverse are called Regular hypergroup. In this regards, for a Regular hypergroup $H$, it is shown that there exists a correspondence between the set of all strongly Regular relations on $H$ and the set of all normal subhypergroups of $H$ containing $S_{\beta}$. More precisely, it has been proven that for every strongly Regular relation $\rho$ on $H$, there exists a unique normal subhypergroup of $H$ containing $S_{\beta}$, such that its quotient is a group, isomorphic to $H/\rho$. Furthermore, this correspondence is extended to a lattice isomorphism between them.

Service Function Chaining is an architecture for orchestrating network services that assign choice to the network. This architecture is essentially a policy structure that should form the proper chain of services. Managing these networks is susceptible to error due to the combination of services with dedicated configurations. Accordingly, solutions will be needed to provide an appropriate ambiance for such a situation. Therefore, before running, the chains must be fully controlled, which requires the definition of chaining rules. Among the issues raised in this architecture are: checking the accuracy of the chains, as well as reducing the number of combinations of service chains. To solve these issues, the Grammar is used in this paper. In this way, based on the scenarios in the Internet Engineering Task Force, they first create them and then their Grammar is obtained using Regular Expressions and Finite Automaton. Subsequently, using the Cocke– Younger– Kasami algorithm, the Grammar evaluation is performed and the number of combinations of services is also shown. The results show that this Grammar can be verified by checking the service chain and also significantly reducing the number of combinations of service chains.

Syntax representation could be considered as the most important phase in developing an NLP system. Most of the Grammars used in these systems are phrase structure ones that try to analyze the sentence by decomposing it into sub constituents. There are alternatives to this approach and link Grammar as one of them is based on the words instead of constituents, hence called lexical Grammar. We are going to assess their ability for Farsi. We do this by starting from the basic relations in Farsi and adding relations to them one by one to give a set of rules for trivial patterns. In each step, link Grammar parser on an appropriate test suit tests the validity of the rules.

The dependency Grammar is one of the Grammar formalisms that is originated according to the dependency relations of lexical elements in a sentence. This dependency is based on the valence of the lexicon; therefore, in this formalism the semantic representation of the words as valence is the backbone of the Grammar. The current paper reviews the book entitled “ Persian Grammar based on the Autonomous Theory in Dependency Grammar” according to three major contents. Firstly, the chapters of the book are briefly overviewed. Then, the book’ s content is evaluated and analyzed and the weak and strong points of the book are studied from different perspectives. In this section, some suggestions are provided for the terminology and expressed concepts. Since dependency Grammar does not belong to generative Grammar, a comparison is made between the dependency and phrase structure Grammar formalisms to understand the content better and to ease the mind of the reader with the generative Grammar background about the basic concepts of the dependency Grammar. At the end, suggestions are provided to extend the dependency Grammar in the book.